Hard Functions for Low-Degree Polynomials over Prime Fields
نویسندگان
چکیده
منابع مشابه
Testing Low-Degree Polynomials over
We describe an efficient randomized algorithm to test if a given binary function is a low-degree polynomial (that is, a sum of low-degree monomials). For a given integer and a given real , the algorithm queries at !" # points. If is a polynomial of degree at most , the algorithm always accepts, and if the value of has to be modified on at least an fraction of all inputs in order to transform it...
متن کاملTesting Low-Degree Polynomials over GF(2(
We describe an efficient randomized algorithm to test if a given binary function f : {0, 1} → {0, 1} is a low-degree polynomial (that is, a sum of low-degree monomials). For a given integer k ≥ 1 and a given real > 0, the algorithm queries f at O( 1 + k4 ) points. If f is a polynomial of degree at most k, the algorithm always accepts, and if the value of f has to be modified on at least an frac...
متن کاملSimultaneous Prime Specializations of Polynomials over Finite Fields
Recently the author proposed a uniform analogue of the Bateman-Horn conjectures for polynomials with coefficients from a finite field (i.e., for polynomials in Fq [T ] rather than Z[T ]). Here we use an explicit form of the Chebotarev density theorem over function fields to prove this conjecture in particular ranges of the parameters. We give some applications including the solution of a proble...
متن کاملRelatively prime polynomials and nonsingular Hankel matrices over finite fields
The probability for two monic polynomials of a positive degree n with coefficients in the finite field Fq to be relatively prime turns out to be identical with the probability for an n × n Hankel matrix over Fq to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is th...
متن کاملLower Bounds for Approximations by Low Degree Polynomials Over
Number 98-36Graph Ramsey Theory and the Polynomial HierarchybyMarcus SchaeferDepartment of Computer ScienceUniversity of Chicago1100 East 58th StreetChicago, Illinois 60637, [email protected] the Ramsey Theory of graphs F ! (G;H) means that for everycoloring of F with colors red and blue there is either a red subgraph Gor a blue su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2013
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2493246.2493248